Burrows–Wheeler compression: Principles and reflections
نویسندگان
چکیده
منابع مشابه
Burrows-Wheeler compression: Principles and reflections
After a general description of the Burrows Wheeler Transform and a brief survey of recent work on processing its output, the paper examines the coding of the zero-runs from the MTF recoding stage, an aspect with little prior treatment. It is concluded that the original scheme proposed by Wheeler is extremely efficient and unlikely to be much improved. The paper then proposes some new interpreta...
متن کاملThe Basic Principles of Data Compression
Compression is the process of encoding data more efficiently to achieve a reduction in file size. One type of compression available is referred to as lossless compression. This means the compressed file will be restored exactly to its original state with no loss of data during the decompression process. This is essential to data compression as the file would be corrupted and unusable should dat...
متن کاملPrinciples of digital dynamic-range compression.
This article provides an overview of dynamic-range compression in digital hearing aids. Digital technology is becoming increasingly common in hearing aids, particularly because of the processing flexibility it offers and the opportunity to create more-effective devices. The focus of the paper is on the algorithms used to build digital compression systems. Of the various approaches that can be u...
متن کاملOn principles of large deviation and selected data compression
The Shannon Noiseless coding theorem (the data-compression principle) asserts that for an information source with an alphabet X = {0, . . . , ` − 1} and an asymptotic equipartition property, one can reduce the number of stored strings (x0, . . . , xn−1) ∈ X n to `nh with an arbitrary small error-probability. Here h is the entropy rate of the source (calculated to the base `). We consider furthe...
متن کاملSpace-Efficient Whole Genome Comparisons with BurrowsWheeler Transforms
The starting point for any alignment of mammalian genomes is the computation of exact matches satisfying various criteria. Time-efficient, O(n), data structures for this computation, such as the suffix tree, require O(n log(n)) space, several times the space of the genomes themselves. Thus, any reasonable whole-genome comparative project finds itself requiring tens of Gigabytes of RAM to mainta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.07.012